Parallel direct methods for solving the system of linear equations with pipelining on a multicore using OpenMP
نویسندگان
چکیده
Recent developments in high performance computer architecture have a significant effect on all fields of scientific computing. Linear algebra and especially the solution of linear systems of equations lie at the heart of many applications in scientific computing. This paper describes and analyzes three parallel versions of the dense direct methods such as the Gaussian elimination method and the LU form of Gaussian elimination that are used in linear system solving on a multicore using an OpenMP interface. More specifically, we present two naive parallel algorithms based on row block and row cyclic data distribution and we put special emphasis on presenting a third parallel algorithm based on the pipeline technique. Further, we propose an implementation of the pipelining technique in OpenMP. Experimental results on a multicore CPU show that the proposed OpenMP pipeline implementation achieves good overall performance compared to the other two naive parallel methods. Finally, in this work we propose a simple, fast and reasonably analytical model to predict the performance of the direct methods with the pipelining technique. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
Super linear speedup in a local parallel meshless solution of thermo-fluid problems
The performance of the parallel implementation of the local meshless numerical method in solving system of coupled partial differential equations is explored. Presented numerical approach makes the computation convenient for parallel implementation using OpenMP based parallelization. The numerical experiments are performed on the de Vahl Davis natural convection case, with superlinear computati...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملParallel computing using MPI and OpenMP on self-configured platform, UMZHPC.
Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...
متن کاملABS-Type Methods for Solving $m$ Linear Equations in $frac{m}{k}$ Steps for $k=1,2,cdots,m$
The ABS methods, introduced by Abaffy, Broyden and Spedicato, aredirect iteration methods for solving a linear system where the$i$-th iteration satisfies the first $i$ equations, therefore a system of $m$ equations is solved in at most $m$ steps. In thispaper, we introduce a class of ABS-type methods for solving a full rowrank linear equations, w...
متن کاملSolving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes
In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 236 شماره
صفحات -
تاریخ انتشار 2011